Color FIC by Adaptive Zero-Mean Method

نویسندگان

  • Loay E. George
  • Eman A. Al-Hilo
چکیده

In this work, a fractal image compression method based on zero-mean block matching method is adopted. In this method the mean of the range blocks is used instead of traditional offset parameter. This reduces and simplifies the computations of the affine parameters during the encoding process. To increase the compression gain the indexes of range mean bits have been coded using DPCM followed by shift coding. Also the scale indexes are shift coded. This method is tested on 24 bits/pixel color image. The data of the color image (R,G,B) are transformed to (Y,U,V) components (to take the advantage of the existing spectral correlation). Also the low spatial resolution of the human vision systems to the chromatic components (U, V) is utilized to increase the compression ratio without making significant subjective distortion. The test results conducted on Lena image indicated encoding time (34.64) sec, compression ratio (10.33) and PSNR (33.85). These results showed reduction in the encoding time about 54.51%, and increase in the compression ratio around 5.24%, and the image quality was nearly preserved in comparison with traditional method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Color FIC by Zero-Mean Method

In this paper, a fractal compression technique based on zero-mean block matching is utilized as unconventional affine mapping. In this method the mean of the range blocks is used instead of traditional offset parameter. This will reduce and simplify the computations of the affine parameter during the encoding process. This method is tested on 24 bits/pixel color image. The data of the color com...

متن کامل

Speeding-Up Color FIC Using

In this paper, speeding-up fractal color image compression technique based on zero-mean method by adding symmetry predictor to reduce the number of isometric trails from 8 to one trail. The first order centralized moments are used to index each domain and range blocks onto one of eight possible isometric states. At each range domain the indices of both domain and range blocks are passed through...

متن کامل

Multichannel adaptive L-filters in color image filtering

Three novel adaptive multichannel L-filters based on marginal data ordering are proposed. They rely on well-known algorithms for the unconstrained minimization of the Mean Squared Error (MSE), namely, the Least Mean Squares (LMS), the normalized LMS (NLMS) and the LMS-Newton (LMSN) algorithm. Performance comparisons in color image filtering have been made both in RGB and U∗V ∗W ∗ color spaces. ...

متن کامل

An Adaptive Fractal Image Compression

In this paper an Adaptive Fractal Image Compression (AFIC) algorithm is proposed to reduce the long time of the Fractal Image Compression (FIC). AFIC worked on; minimizing the complexity and the number of matching operations by reducing both of the range and domain blocks needed in the matching process, for this purpose Zero Mean Intensity Level Fractal Image Compression based on Quadtree parti...

متن کامل

Robust human tracking based on multi-cue integration and mean-shift

Multi-cue integration has been researched extensively for robust visual tracking. Researchers aim to use multiple cues under the probabilistic methods, such as Particle Filtering and Condensation. On the other hand, Color-based Mean-Shift has been addressed as an effective and fast algorithm for tracking color blobs. However, this deterministic searching method suffers from objects with low sat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010